Constructing Hyperbolic Polyhedra Using Newton's Method
نویسنده
چکیده
We demonstrate how to construct three-dimensional compact hyperbolic polyhedra using Newton’s Method. Under the restriction that the dihedral angles are non-obtuse, Andreev’s Theorem [5, 6] provides as necessary and sufficient conditions five classes of linear inequalities for the dihedral angles of a compact hyperbolic polyhedron realizing a given combinatorial structure C. Andreev’s Theorem also shows that the resulting polyhedron is unique, up to hyperbolic isometry. An error in Andreev’s original proof of existence was found by the author while writing the computer program described in this paper and corrected by the author in a joint publication with Hubbard, and Dunbar in [12, 18]. Our construction uses Newton’s method and a homotopy method to explicitly follow the existence proof presented in [12, 18]. 1 Statement of Andreev’s Theorem Andreev’s Theorem [5, 6] provides a complete characterization of compact hyperbolic polyhedra having non-obtuse dihedral angles. In [12, 18], we explain an error in Andreev’s proof found while writing the computer program described in this paper and we provide a correction of Andreev’s proof. Other approaches to Andreev’s Theorem can be found by Rivin and Hodgson [15, 9], Thurston [24], Marden and Rodin [14], and Bowers and Stephenson [8]. In this paper we show that the proof from [12, 18] is constructive when combined with Newton’s Method for solving nonlinear equations. Combinatorial descriptions of hyperbolic polyhedra that are relevant to Andreev’s Theorem fall into three classes, simple, truncated, and compound, all defined later in this section. The proof in [12, 18] provides an explicit continuous path in the space of polyhedra deforming a given simple polyhedron P to one of two which are easily constructed by hand: the N -faced prism PrN and the N -faced split prism DN . We use Newton’s method to follow such a [email protected] Partially supported by a U.S. National Defense Science and Engineering Fellowship and by the Fields Institute as a Jerrold E. Marsden postdoctoral fellow.
منابع مشابه
Cauchy Rigidity of C -polyhedra
We generalize Cauchy’s celebrated theorem on the global rigidity of convex polyhedra in Euclidean 3-space E to the context of circle polyhedra in the 2-sphere S. We prove that any two convex and bounded non-unitary c-polyhedra with Möbiuscongruent faces that are consistently oriented are Möbius-congruent. Our result implies the global rigidity of convex inversive distance circle packings as wel...
متن کاملAcceleration Techniques for Newton's Non-linear Iterative Scheme Acceleration Techniques for Newton's Non-linear Iterative Scheme Acceleration Techniques for Newton's Non-linear Iterative Scheme
The solution of non-linear sets of algebraic equations is usually obtained by the Newton's method, exhibiting quadratic convergence. For practical simulations, a signiicant computational eeort consists in the evaluation of the Jacobian matrices. In this paper, we propose and experiment various methods to speed the convergence process either by re-using information from previous iterates or by b...
متن کاملAn Inequality for Polyhedra and Ideal Triangulations of Cusped Hyperbolic 3-manifolds
It is not known whether every noncompact hyperbolic 3-manifold of finite volume admits a decomposition into ideal tetrahedra. We give a partial solution to this problem: Let M be a hyperbolic 3-manifold obtained by identifying the faces of n convex ideal polyhedra P1, . . . , Pn. If the faces of P1, . . . , Pn−1 are glued to Pn, then M can be decomposed into ideal tetrahedra by subdividing the ...
متن کاملBlending Polyhedra with Overlays
We introduce a novel method for constructing polyhedra by blending together two or more existing polyhedra, using a dualization method. The method results in a Minkowski sum, analogous to that of overlay tilings [5], which uses a topological dual operation to create tilings from a network (a graph embedded in a plane). This paper extends that method to networks on the surface of the unit sphere...
متن کاملOrganizing Volumes of Right-angled Hyperbolic Polyhedra
This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the combinatorics of such a polyhedron, while keeping it within the class of right-angled objects, until it is a disjoint union of Löbell polyhedra, a class of poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 16 شماره
صفحات -
تاریخ انتشار 2007